Optimization of Open Queuing Networks with Batch Services
نویسندگان
چکیده
In this paper, open queuing networks with Poisson arrivals and single-server infinite buffer queues are considered. Unlike traditional models, customers served (with exponential service time) in batches, so that the nodes non-work-conserving. The main contribution of work is design an efficient algorithm to find batch sizes which minimize average response time network. As preliminary steps at basis proposed algorithm, analytical expression sojourn each node derived, it shown function, depending on size, has a single minimum. goodness formula were verified through discrete-event simulation for network non-tree structure.
منابع مشابه
Modeling Short-Lived TCP Connections with Open Multiclass Queuing Networks
In this paper we develop an open multiclass queuing network model to describe the behavior of short-lived TCP connections sharing a common IP network for the transfer of TCP segments. The queuing network model is paired with a simple model of the IP network, and the two models are solved through an iterative procedure. The combined model needs as inputs only the primitive network parameters, an...
متن کاملQueuing for Expert Services
We consider a monopolist expert offering a service with a ‘credence’ characteristic. A credence service is one where the customer cannot verify, even after a purchase, whether the amount of prescribed service was appropriate or not; examples include legal, medical or consultancy services and car repair. This creates an incentive for the expert to ‘induce service’, that is, to provide unnecessar...
متن کاملMulti-Class Queuing Networks Models for Energy Optimization
The increase of energy consumption and the related costs in large data centers has stimulated new researches on techniques to optimize the power consumption of the servers. In this paper we focus on systems that should process a peak workload consisting of different classes of applications. The objective is to implement a policy of load control which allows an efficient use of the power deploye...
متن کاملMetastability of Queuing Networks with Mobile Servers
We study symmetric queuing networks with moving servers and FIFO service discipline. The mean-field limit dynamics demonstrates unexpected behavior which we attribute to the metastability phenomenon. Large enough finite symmetric networks on regular graphs are proved to be transient for arbitrarily small inflow rates. However, the limiting non-linear Markov process possesses at least two statio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2022
ISSN: ['2227-7390']
DOI: https://doi.org/10.3390/math10163027